A fast two-step algorithm for invasion percolation with trapping
نویسندگان
چکیده
منابع مشابه
Trapping thresholds in invasion percolation.
We give numerical estimates for the site percolation trapping thresholds for invasion percolation on various three dimensional lattices. We find that in most cases the thresholds for invasion and ordinary percolation coincide. However, for coordination numbers less than five the thresholds diverge. Since most rock networks exhibit coordination numbers less than five the rules for simulating res...
متن کاملPercolation with trapping
A novel form of percolation is considered which is motivated by models of the displacement of one fluid by another from a porous medium. The physical idea is that if the displaced phase is incompressible, then regions of it which are surrounded by the displacing fluid become ‘trapped’ and cannot subsequently be invaded. We thus consider a new percolation process, ‘percolation with trapping’, in...
متن کاملInvasion Percolation in Presence of Gravity
Simultaneous capillary dominated displacement of the wetting and non-wetting phases are processes of interest in many disciplines including modeling of the penetration of polluting liquids in hydrology or the secondary migration in petroleum reservoir engineering. Percolation models and in particular invasion percolation is well suited to characterize the slow immiscible displaceme...
متن کاملSequential algorithm for fast clique percolation.
In complex network research clique percolation, introduced by Palla, Derényi, and Vicsek [Nature (London) 435, 814 (2005)], is a deterministic community detection method which allows for overlapping communities and is purely based on local topological properties of a network. Here we present a sequential clique percolation algorithm (SCP) to do fast community detection in weighted and unweighte...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Geosciences
سال: 2016
ISSN: 0098-3004
DOI: 10.1016/j.cageo.2016.02.003